Soft decoding of algebraic–geometric codes using Koetter-Vardy algorithm
نویسنده
چکیده
The first soft-decision decoding algorithm for algebraic–geometric codes is presented. This algorithm is developed based on the Koetter-Vardy algorithm, which was proposed for the decoding of Reed-Solomon codes. The interpolation process is modified by redefining the zero condition of a trivariate polynomial and introducing complexity reducing methods. Simulation results show that 0.7 and 1.7 dB performance improvements over the hard-decision decoding bound can be achieved in AWGN and quasi-static Rayleigh fading channels, respectively.
منابع مشابه
A Vlsi Architecture for Interpolation in Soft-decision List Decoding of Reed-solomon Codes
The Koetter-Vardy algorithm is an algebraic soft-decision decoder for Reed-Solomon codes which is based on the Guruswami-Sudan list decoder. There are three main steps: 1) multiplicity calculation, 2) interpolation and 3) root finding. The Koetter-Vardy algorithm is challenging to implement due to the high cost of interpolation. We propose a VLSI architecture for interpolation that uses a trans...
متن کاملA Complexity Reducing Transformation in Algebraic List Decoding of Reed-Solomon Codes
The main computational steps in algebraic soft-decoding, as well as Sudan-type list-decoding, of ReedSolomon codes are interpolation and factorization. A series of transformations is given for the interpolation problem that arises in these decoding algorithms. These transformations reduce the space and time complexity to a small fraction of the complexity of the original interpolation problem. ...
متن کاملUpper Bounds on the Number of Errors Corrected by the Koetter-Vardy Algorithm
By introducing a few simplifying assumptions we derive a simple condition for successful decoding using the Koetter–Vardy algorithm for soft-decision decoding of Reed–Solomon codes. We show that the algorithm has a significant advantage over hard decision decoding when the code rate is low, when two or more sets of received symbols have substantially different reliabilities, or when the number ...
متن کاملAttaining Capacity with Algebraic Geometry Codes through the (U|U+V) Construction and Koetter-Vardy Soft Decoding
In this paper we show how to attain the capacity of discrete symmetric channels with polynomial time decoding complexity by considering iterated (U | U + V ) constructions with Reed-Solomon code or algebraic geometry code components. These codes are decoded with a recursive computation of the a posteriori probabilities of the code symbols together with the Koetter-Vardy soft decoder used for de...
متن کاملAlgebraic Soft-Decision Decoding of Reed-Solomon Codes Using Bit-level Soft Information
The performance of algebraic soft-decision decoding (ASD) of Reed-Solomon (RS) codes using bit-level soft information is investigated. Optimal multiplicity assignment strategies (MAS) of ASD with infinite cost are first studied over erasure channels and binary symmetric channels (BSC). The corresponding decoding radii are calculated in closed forms and tight bounds on the error probability are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009